Parsing String Generating Hypergraph Grammars
نویسندگان
چکیده
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of these grammars, string languages like anbncn can be modeled that can not be generated by context-free grammars for strings. They are well suited to model discontinuous constituents in natural languages, i.e. constituents that are interrupted by other constituents. For parsing context-free Chomsky grammars, the Earley parser is well known. In this paper, an Earley parser for string generating hypergraph grammars is presented, leading to a parser for natural languages that is able to handle discontinuities. 1 Discontinuous Constituents in German One (of many) problems when parsing German are discontinuous constituents [1]. Discontinuous constituents are constituents which are separated by one or more other constituents and still belong together on a semantic or syntactic level. An example for a discontinuous constituent is (1) Er hat schnell gearbeitet. He has fast worked. He (has) worked fast. The verb phrase hat gearbeitet ((has) worked) is distributed; the finite verb part, the auxiliary verb hat (has), is always in the second position in a German declarative sentence. The infinite verb part, the past participle gearbeitet (worked), is usually in the last position of a declarative sentence, only a few exceptions like relative clauses or appositions can be put after the infinite verb part. Another (more complicated) German example of discontinuous constituents is 1 The German examples are first translated word by word into English to explain the German sentence structure and then reordered into a correct English sentence. 2 The present perfect in German can be translated either in present perfect or in past tense in English.
منابع مشابه
String Generating Hypergraph Grammars with Word Order Restrictions
Discontinuous constituents and free word order pose constant problems in natural language parsing. String generating hypergraph grammars have been proven useful for handling discontinuous constituents. In this paper we describe a new notation for hypergraph productions that allows on-the-fly interconnection of graph parts with regard to user-defined constraints. These constraints handle the ord...
متن کاملContextual Hypergraph Grammars - A New Approach to the Generation of Hypergraph Languages
In this paper, we introduce contextual hypergraph grammars, which generalize the total contextual string grammars. We study the position of the class of languages generated by contextual hypergraph grammars in comparison with graph languages generated by hyperedge replacement grammars and double-pushout hypergraph grammars. Moreover, several examples show the potential of the new class of gramm...
متن کاملGraph parsing with s-graph grammars
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible analyses of a given graph according to a grammar. This problem arises in training synchronous string-to-graph grammars, and when generating strings from them. We present two algorithms for graph parsing (bottom-up and top-down) with s-graph grammars. On the related problem o...
متن کاملDeterministic graph grammars
Context-free grammars are one of the most classical and fundamental notions in computer science textbooks, in both theoretical and applied settings. As characterizations of the well-known class of context-free languages, they are a very prominent tool in the field of language theory. Since contextfree grammars are powerful enough to express most programming languages, they also play an importan...
متن کاملAn Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been adopted to hypergraphs successfully by Lautemann. Therewith, many practically relevant hypergraph languages generated by hyperedge replacement can be parsed in an acceptable time. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fre...
متن کامل